In Brute-Force Search of Correlation Bounds for Polynomials
نویسندگان
چکیده
We report on some initial results of a brute-force search for determining the maximum correlation between degree-d polynomials modulo p and the n-bit mod q function. For various settings of the parameters n, d, p, and q, our results indicate that symmetric polynomials yield the maximum correlation. This contrasts with the previouslyanalyzed settings of parameters, where non-symmetric polynomials yield the maximum correlation. We also prove new properties of maximum-correlation polynomials, and use those to obtain a new setting of parameters where those polynomials are not symmetric.
منابع مشابه
A Performance Survey of Meta-Heuristic And Brute-Force Search Algorithms to Cryptanalysis The SDES Encryption Algorithm
For many years, cryptanalysis has been considered as an attractive topic in jeopardizing the security and resistance of an encryption algorithm. The SDES encryption algorithm is a symmetric cryptography algorithm that performs a cryptographic operation using a crypt key. In the world of encryption, there are many search algorithms to cryptanalysis. In these researches, brute force attack algori...
متن کاملT C C C
I discuss recent progress in developing and exploiting connections between SAT algorithms and circuit lower bounds. The centrepiece of the article is Williams’ proof that NEXP * ACC0, which proceeds via a new algorithm for ACC0-SAT beating brute-force search. His result exploits a formal connection from non-trivial SAT algorithms to circuit lower bounds. I also discuss various connections in th...
متن کاملAverage-Case Lower Bounds and Satisfiability Algorithms for Small Threshold Circuits
We show average-case lower bounds for explicit Boolean functions against bounded-depth thresh-old circuits with a superlinear number of wires. We show that for each integer d > 1, there isεd > 0 such that Parity has correlation at most 1/nΩ(1) with depth-d threshold circuits whichhave at most n1+εd wires, and the Generalized Andreev Function has correlation at most 1/2nwith ...
متن کاملA Stream Cipher Algorithm based on Nonlinear Combination Generator with Enhanced Security for Image Encryption
This paper describes a novel approach for image encryption using stream cipher algorithm based on non linear combination generator. This work aims to enhance the security of encrypted image. The work is based on the use of several linear feedback shifts registers whose feedback polynomials are primitive and of degrees are all pair wise cop rimes combined by resilient function whose resiliency o...
متن کاملIronic Complicity: Satisfiability Algorithms and Circuit Lower Bounds
I discuss recent progress in developing and exploiting connections between SAT algorithms and circuit lower bounds. The centrepiece of the article is Williams’ proof that NEXP 6⊆ ACC, which proceeds via a new algorithm for ACC-SAT beating brute-force search. His result exploits a formal connection from non-trivial SAT algorithms to circuit lower bounds. I also discuss various connections in the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electronic Colloquium on Computational Complexity (ECCC)
دوره 18 شماره
صفحات -
تاریخ انتشار 2011